Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
نویسندگان
چکیده
منابع مشابه
Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs
In 1], Al-Mohummed proposed a method for evaluating a lower bound on the completion time and the number of processors required for scheduling precedence graphs with communication costs. In this note, we show that the method in 1] for evaluating a lower bound on the number of processors is incorrect. As a result, some precedence graphs can be feasibly scheduled using fewer processors than the lo...
متن کاملScheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
We study the problem of scheduling unit-length interval-ordered tasks subject to unit-length communication delays with the objective of minimising the maximum tardiness. Without communication delays, this problem can be solved by a generalisation of an algorithm presented by Garey and Johnson. In this paper, an algorithm is presented that considers unit-length communication delays and construct...
متن کاملScheduling Tasks with Communication Delays on Parallel Processors
Let Jn={v1,...,vn} be a set of n jobs to be executed and E a set of precedence constraints on Jn. Assume that we have available a set Mk={m1,...,mk} of k identical machines that are to execute the jobs in Jn such that the time needed by any machine to execute each job in Jn is one unit. Our main result in this paper is to give an O(n log2(n)) algorithm to find an optimal scheduling with communi...
متن کاملScheduling Complete Intrees on Two Uniform Processors with Communication Delays
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
متن کاملScheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling uect (Unit Execution and Communication Time) trees on two identical processors: CBoS (clusters based on subtrees). The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non uet tasks. Nous pr esentons un n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2013
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2013028